Reed-Solomon Codes for Low Power Communications
نویسندگان
چکیده
Power consumption is a critical issue for many applications running on autonomous battery operated devices. In the context of low power communications, the use of Forward Error Correction (FEC) schemes shall therefore not only be considered as a way to improve communication robustness but also as a way to reduce transmit power. The benefits of this approach can be assessed by analyzing the tradeoff between the additional performance gained and the power consumption overhead resulting from extra computations. In this paper, a selection method is described to size the parameters of a low power Reed-Solomon (RS) code. The rationale highlights the influence of code parameters on computational complexity and performance of the code. An efficient set of code parameters can be deduced from this analysis to reduce the global power consumption of the system. Among the RS codes considered, the shortened RS(40,32,4) code over GF(2) is selected for further implementation analysis. Several design improvements are investigated step by step, and the relative power savings achieved with each enhancement are quantified. These results tend to illustrate the improvements that can be reached with only little design efforts.
منابع مشابه
On the use of Reed-Solomon codes to extend link margin and communication range in low-power wireless networks
Reed-Solomon (RS) codes are commonly used to correct burst errors in applications such as storage devices, data transmission, bar-code readers, and satellite communications. In this paper, we evaluate the use of RS coding to improve link margin and communication range in a low power wireless network. Performance metrics are also evaluated for latency and processing time required to perform the ...
متن کاملA general construction of Reed-Solomon codes based on generalized discrete Fourier transform
In this paper, we employ the concept of the Generalized Discrete Fourier Transform, which in turn relies on the Hasse derivative of polynomials, to give a general construction of Reed-Solomon codes over Galois fields of characteristic not necessarily co-prime with the length of the code. The constructed linear codes enjoy nice algebraic properties just as the classic one.
متن کاملEfficient decoding algorithms for generalized Reed-Muller codes
OFDM, power, Reed-Muller code, decoding, algorithms, error correction Recently a class of generalised Reed-Muller codes has been suggested for use in power-controlled OFDM modulation. A number of approaches to decoding these codes have already been developed. Here we present low complexity alternatives which are inspired by the classical Reed decoding algorithm for binary Reed-Muller codes. We ...
متن کاملAn Introduction to Reed-Solomon Codes
Journal of the Society for Industrial and Applied Mathematics. In June of 1960 the paper was published: five pages under the rather unpretentious title "Polynomial Codes over Certain Finite Fields" [17]. This paper described a new class of error-correcting codes that are now called Reed-Solomon codes. In the decades since their discovery, Reed-Solomon codes have enjoyed countless applications, ...
متن کاملFast Encoding of Polar Codes With Reed-Solomon Kernel
A low-complexity systematic encoding algorithm for polar codes with Reed-Solomon kernel is presented. The proposed method relies on fast Fourier transform based ReedSolomon encoding techniques. Application of polar codes in storage systems is considered.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- JCM
دوره 3 شماره
صفحات -
تاریخ انتشار 2008